Algebraic Feedback Shift Registers

نویسندگان

  • Andrew Klapper
  • Jinzhong Xu
چکیده

A general framework for the design of feedback registers based on algebra over complete rings is described. These registers generalize linear feedback shift registers and feedback with carry shift registers. Basic properties of the output sequences are studied: relations to the algebra of the underlying ring; synthesis of the register from the sequence (which has implications for cryptanalysis); and basic statistical properties. These considerations lead to security measures for stream ciphers, analogous to the notion of linear complexity that arises from linear feedback shift registers. We also show that when the underlying ring is a polynomial ring over a finite field, the new registers can be simulated by linear feedback shift registers with small nonlinear filters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes

In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based on the algebra of π-adic numbers, where π is an element in a ring R, and produce sequences of elements in R/(π). We give several cases where the register synthesis problem can be solved by an efficient algorithm. Conseq...

متن کامل

Algebraic Feedback Shift Registers Based on Function Fields

We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations of linear feedback shift registers. We describe conditions under which such AFSRs produce sequences with various ideal randomness properties. We also show that there is an efficient algorithm which, given a prefix of a s...

متن کامل

Combining Certain Nonlinear Feedback Shift Registers

Stream ciphers that deploy linear feedback shift registers (LFSRs) have been shown to be vulnerable under fast correlation attacks [20], [21], [14], algebraic attacks [7], [28], fast algebraic attacks [6], [1], and fault attacks [13]. We discuss certain nonlinear feedback shift registers (NLFSRs) recommended as substitutes for LFSRs in stream cipher systems.

متن کامل

Searching for Nonlinear Feedback Shift Registers with Parallel Computing

Nonlinear feedback shift registers (NLFSRs) are used to construct pseudorandom generators for stream ciphers. Their theory is not so complete as that of linear feedback shift registers (LFSRs). In general, it is not known how to construct all NLFSRs with maximum period. The direct method is to search for such registers with suitable properties. Advanced technology of parallel computing has been...

متن کامل

Polynomial pseudo-noise sequences based on algebraic feedback shift registers

We apply the framework of algebraic feedback shift registers to polynomial rings over finite fields. This gives a construction of new pseudorandom sequences (over non-prime finite fields), which satisfy Golomb’s three randomness criteria.

متن کامل

Large Period Nearly deBruijn FCSR Sequences ( Extended

Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. Jn this paper we exhibit a tpchnique for easily fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 226  شماره 

صفحات  -

تاریخ انتشار 1999